Appendix to Quicksort Asymptotics

نویسندگان

  • James Allen Fill
  • Svante Janson
چکیده

This appendix to [2] contains a proof of the improved estimates in Remark 7.3 of that paper for the moment generating function of the (normalized) number of comparisons in Quicksort. AMS 2000 subject classifications. Primary 68W40; secondary 68P10, 60F05, 60E10. Date. May 22, 2001. Research supported by NSF grant DMS–9803780, and by The Johns Hopkins University’s Acheson J. Duncan Fund for the Advancement of Research in Statistics. 1 This is an appendix to [2], to which we refer for background and notation. The theorem, lemmas, and equations in this appendix are labelled by A.1, etc.; labels with pure numbers refer to [2]. The purpose of this appendix is to provide a proof of the following estimates stated in Remark 7.3 of [2]. Theorem A.1. Let L0 . = 5.018 be the largest root of e = 6L2. Then, for all n ≥ 0,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the quicksort asymptotics

In a recent paper, Bindjeme and Fill obtained a surprisingly easy exact formula for the L2-distance of the (normalized) number of comparisons of Quicksort under the uniform model to its limit. Shortly afterwards, Neininger proved a central limit theorem for the error. As a consequence, he obtained the asymptotics of the L3-distance. In this short note, we use the moment transfer approach to re-...

متن کامل

On the tails of the limiting Quicksort distribution

We give asymptotics for the left and right tails of the limiting Quicksort distribution. The results agree with, but are less precise than, earlier non-rigorous results by Knessl and Spankowski.

متن کامل

Refined quicksort asymptotics

The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of n data, permuted uniformly at random, the appropriately normalized complexity Yn is known to converge almost surely to a non-degenerate random limit Y. This assumes a natural embedding of all Yn on one probability space, e.g., via random binary se...

متن کامل

M ay 2 00 1 Quicksort Asymptotics

The number of comparisons X n used by Quicksort to sort an array of n distinct numbers has mean µ n of order n log n and standard deviation of order n. Using different methods, Régnier and Rösler each showed that the normalized variate Y n := (X n −µ n)/n converges in distribution, say to Y ; the distribution of Y can be characterized as the unique fixed point with zero mean of a certain distri...

متن کامل

Quicksort Algorithm Again Revisited

We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length n in a randomly built binary search tree. Obtaining the limiting distribution of n is still an outstanding open problem. In this paper, we establish an integral equation for the probability density of the number of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007